Compact Difference Bound Matrices
نویسندگان
چکیده
The Octagon domain, which tracks a restricted class of two variable inequality, is the abstract domain of choice for many applications because its domain operations are either quadratic or cubic in the number of program variables. Octagon constraints are classically represented using a Difference Bound Matrix (DBM), where the entries in the DBM store bounds c for inequalities of the form xi ́ xj ď c, xi ` xj ď c or ́xi ́ xj ď c. The size of such a DBM is quadratic in the number of variables, giving a representation which can be excessively large for number systems such as rationals. This paper proposes a compact representation for DBMs, in which repeated numbers are factored out of the DBM. The paper explains how the entries of a DBM are distributed, and how this distribution can be exploited to save space and significantly speed-up long-running analyses. Moreover, unlike sparse representations, the domain operations retain their conceptually simplicity and ease of implementation whilst reducing memory usage.
منابع مشابه
The Constraint Database Approach to Software Verification
Based on constraint database techniques, we present a new approach to software verification. This new approach has some similarity to abstract interpretation that uses various widening operators; therefore, we call the new approach l-u widening. We show that our l-u widening leads to a more precise over-approximation of the invariants in a program than comparable previously proposed widening op...
متن کاملامید ریاضی نرخ پوشش برای ماتریسهای هلمن
Hellman’s time-memory trade-off is a probabilistic method for inverting one-way functions, using pre-computed data. Hellman introduced this method in 1980 and obtained a lower bound for the success probability of his algorithm. After that, all further analyses of researchers are based on this lower bound. In this paper, we first studied the expected coverage rate (ECR) of the Hellman matrice...
متن کاملEigenvalue Bounds in the Gaps of Schrödinger Operators and Jacobi Matrices
We consider C = A+B where A is selfadjoint with a gap (a, b) in its spectrum and B is (relatively) compact. We prove a general result allowing B of indefinite sign and apply it to obtain a (δV ) bound for perturbations of suitable periodic Schrödinger operators and a (not quite) Lieb–Thirring bound for perturbations of algebro-geometric almost periodic Jacobi matrices.
متن کاملOn compact operators on the Riesz -difference sequence space
In this paper, we give the characterization of some classes of compact operators given by matrices on the normed sequence space , which is a special case of the paranormed Riesz -difference sequence space , . For this purpose, we apply the Hausdorff measure of noncompactness and use some results.
متن کامل